A zero-one law for logic with a fixed-point operator
نویسندگان
چکیده
منابع مشابه
A Zero-One Law for Logic with a Fixed-Point Operator
The logic obtained by adding the least-fixed-point operator to first-order logic was proposed as a query language by Aho and Ullman (in "Proc. 6th ACM Sympos. on Principles of Programming Languages," 1979, pp. 110-120) and has been studied, particularly in connection with finite models, by numerous authors. We extend to this logic, and to the logic containing the more powerful iterative-fixedpo...
متن کاملBetter logic obeying a zero-one law
We study zero-one laws for random graphs. We focus on the following question that was asked by many: Given a graph property P , is there a language of graphs able to express P while obeying the zeroone law? Our results show that on the one hand there is a (regular) language able to express connectivity and k-colorability for any constant k and still obey the zero-one law. On the other hand we s...
متن کاملA strong convergence theorem for solutions of zero point problems and fixed point problems
Zero point problems of the sum of two monotone mappings and fixed point problems of a strictly pseudocontractive mapping are investigated. A strong convergence theorem for the common solutions of the problems is established in the framework of Hilbert spaces.
متن کاملA geometric zero-one law
Each relational structure X has an associated Gaifman graph, which endows X with the properties of a graph. If x is an element of X, let Bn(x) be the ball of radius n around x. Suppose that X is infinite, connected and of bounded degree. A first-order sentence φ in the language of X is almost surely true (resp. a.s. false) for finite substructures of X if for every x ∈ X, the fraction of substr...
متن کاملA Zero-One Law for Maps
A class of structures has a 0{1 law when any property expressible in a certain logic has limiting probability 0 or 1 as the size of the structures tends to innnity. We prove 0{1 laws for classes of maps of a given genus. This is a joint work with E. Bender and B. Richmond 1]. 1. Deenition of the problem Let S be a set of primitive elements called sorts. A vocabulary consists of a collection of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1985
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(85)80027-9